McNaughton families of languages
نویسندگان
چکیده
منابع مشابه
Learning Automatic Families of Languages
A class of languages is automatic if it is uniformly regular using some regular index set for the languages. In this survey we report on work about the learnability in the limit of automatic classes of languages, with some special emphasis to automatic learners.
متن کاملAlgebraic aspects of families of fuzzy languages
We study operations on fuzzy languages such as union, concatenation, Kleene ⋆, intersection with regular fuzzy languages, and several kinds of (iterated) fuzzy substitution. Then we consider families of fuzzy languages, closed under a fixed collection of these operations, which results in the concept of full Abstract Family of Fuzzy Languages or full AFFL. This algebraic structure is the fuzzy ...
متن کاملAbstract Families of Abstract Categorial Languages
Families of Abstract Categorial Languages
متن کاملOptimal strategic reasoning with McNaughton functions
Article history: Received 31 December 2013 Received in revised form 7 April 2014 Accepted 7 April 2014 Available online 24 April 2014
متن کاملFamilies of DFAs as Acceptors of $ω$-Regular Languages
Families of dfas (fdfas) provide an alternative formalism for recognizing ω-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the Myhill-Nerode theorem for regular languages. This correlation is beneficial for learning algorithms, and indeed it was recently shown that ω-regular lan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00070-1